منابع مشابه
Reasoning About Transfinite Sequences
We introduce a family of temporal logics to specify the behavior of systems with Zeno behaviors. We extend linear-time temporal logic LTL to authorize models admitting Zeno sequences of actions and quantitative temporal operators indexed by ordinals replace the standard next-time and until future-time operators. Our aim is to control such systems by designing controllers that safely work on ω-s...
متن کاملReasoning about transfinite sequences (extended abtract)
We introduce a family of temporal logics to specify the behavior of systems with Zeno behaviors. We extend linear-time temporal logic LTL to authorize models admitting Zeno sequences of actions and quantitative temporal operators indexed by ordinals replace the standard next-time and until future-time operators. Our aim is to control such systems by designing controllers that safely work on ω-s...
متن کاملReasoning About Sequences of Memory States
Motivated by the verification of programs with pointer variables, we introduce a temporal logic LTL whose underlying assertion language is the quantifier-free fragment of separation logic and the temporal logic on the top of it is the standard linear-time temporal logic LTL. We analyze the complexity of various model-checking and satisfiability problems for LTL, considering various fragments of...
متن کاملReasoning about Assembly Sequences Based on Description Logic and Rule
Reasoning about assembly sequences is useful for identifying the feasibility of assembly sequences according to the assembly knowledge. Technologies used for reasoning about assembly sequences have crucial impacts on the efficiency and automation of assembly sequence planning. Description Logic (DL) is well-known for representing and reasoning about knowledge of static application domains; it o...
متن کاملReasoning about Deterministic Action Sequences with Probabilistic Priors
We present a novel algorithm and a new understanding of reasoning about a sequence of deterministic actions with a probabilistic prior. When the initial state of a dynamic system is unknown, a probability distribution can be still specified over the initial states. Estimating the posterior distribution over states (filtering) after some deterministic actions occurred is a problem relevant to AI...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Foundations of Computer Science
سال: 2007
ISSN: 0129-0541,1793-6373
DOI: 10.1142/s0129054107004589